On fluid queueing systems with strict priority

نویسندگان

  • Yong Liu
  • Weibo Gong
چکیده

We consider priority fluid queueing systems where high priority class has strict priority access to service. Sample path analysis tools, such as Poisson Counter Driven Stochastic Differential Equation, are employed to study system queueing behavior in steady state. We are able to obtain various analytical results for different fluid traffic models and system configurations. Those results can be used as a general rule of thumb in buffer dimensioning and other traffic engineering issues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof of Monotone Loss Rate of Fluid Priority-Queue with Finite Buffer

This paper studies a fluid queueing system that has a single server, a single finite buffer, and which applies a strict priority discipline to multiple arriving streams of different classes. The arriving streams are modeled by statistically independent, identically distributed random processes. A proof is presented for the highly intuitive result that, in such a queueing system, a higher priori...

متن کامل

Per-flow guarantees under class-based priority queueing

In this paper, we present an admission control scheme which provides per-flow delay and bandwidth guarantees based solely upon simple class-based strict priority queue-ing. We derive basic properties of the worst-case behaviour in strict priority queueing systems using network calculus. Building upon these properties the flow admission control scheme is devised. The rationale behind this work i...

متن کامل

Packet Models Revisited: Tandem and Priority Systems

We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution o...

متن کامل

On converse Lyapunov theorems for fluid network models

We consider the class of closed generic fluid networks (GFN) models, which provides an abstract framework containing a wide variety of fluid networks. Within this framework a Lyapunov method for stability of GFN models was proposed by Ye and Chen. They proved that stability of a GFN model is equivalent to the existence of a functional on the set of paths that is decaying along paths. This resul...

متن کامل

Instability Phenomena in Underloaded Packet Networks with QoS Schedulers

Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the recent literature. Underload instabilities can be produced by complex scheduling algorithms...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2003